Mouse-Sensitive Following Path Suggestion for Drawing Travel Routes in Web Map Systems
نویسندگان
چکیده
منابع مشابه
Mouse-Sensitive Following Path Suggestion for Drawing Travel Routes in Web Map Systems
This paper proposes a web map system for drawing an arbitrary travel route using a mouse-sensitive following path suggestion. The interaction model of the system allows users to intuitively understand the sequence of user actions needed to draw a conceived route and reduces the number of user actions required. Moreover, the system allows users to understand at a glance several drawing alternati...
متن کاملDrawing the scientific map of Islamic Azad University Medical Sciences products in Web of Science site
Background: The aim of this research was to analyze and illustrate scientific productions of Islamic Azad University researchers under title of Medical Sciences in Web of Science (WOS) data base. Materials and methods: The present study was a kind of applied scientific research which studied the quantitative performance of Islamic Azad University of Medical Sciences in WOS database from beginni...
متن کاملVenous Thromboembolism Following Travel
International travel has become increasingly common and accessible, hence, about two billion passengers undertake international and domestic air travel each year. Venous thromboembolism (VTE) is a serious public health disorder which may occur following prolonged travel, especially after air travel. A direct relation between VTE development and prolonged travels has been documented, while some ...
متن کاملObject modeling and path computation for multimodal travel systems
This paper describes a multimodal travel system (MTS) designed to address the needs of a variety of demand-responsive transport. An origin–destination (O–D) trip in transportation network can be accomplished by using multiple modes. In urban network passengers may boarding buses or metros to go from one place to another, and modes as autobus or trains are used by passengers to travel between ci...
متن کاملPrimal-dual path-following algorithms for circular programming
Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Geographic Information System
سال: 2012
ISSN: 2151-1950,2151-1969
DOI: 10.4236/jgis.2012.45045